TSTP Solution File: GRA031^1 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : GRA031^1 : TPTP v6.1.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n102.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:22:13 EDT 2014
% Result : Timeout 300.01s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : GRA031^1 : TPTP v6.1.0. Released v3.6.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n102.star.cs.uiowa.edu
% % Model : x86_64 x86_64
% % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory : 32286.75MB
% % OS : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 07:38:46 CDT 2014
% % CPUTime : 300.01
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (forall (G:((Prop->(Prop->Prop))->((Prop->(Prop->Prop))->Prop))), ((forall (Xx:(Prop->(Prop->Prop))) (Xy:(Prop->(Prop->Prop))), (((G Xx) Xy)->((G Xy) Xx)))->((or ((ex (Prop->(Prop->Prop))) (fun (Xx0:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx1:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx2:(Prop->(Prop->Prop)))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp0:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp1:((Prop->(Prop->Prop))->Prop))=> ((and ((and ((and ((and ((and ((and ((and ((and (Xp0 Xx0)) ((Xp0 Xx1)->False))) ((Xp0 Xx2)->False))) ((Xp1 Xx0)->False))) (Xp1 Xx1))) ((Xp1 Xx2)->False))) ((G Xx1) Xx0))) ((G Xx2) Xx0))) ((G Xx2) Xx1))))))))))))) ((ex (Prop->(Prop->Prop))) (fun (Xx0:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx1:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx2:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx3:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx4:(Prop->(Prop->Prop)))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp0:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp1:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp2:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp3:((Prop->(Prop->Prop))->Prop))=> ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and (Xp0 Xx0)) ((Xp0 Xx1)->False))) ((Xp0 Xx2)->False))) ((Xp0 Xx3)->False))) ((Xp0 Xx4)->False))) ((Xp1 Xx0)->False))) (Xp1 Xx1))) ((Xp1 Xx2)->False))) ((Xp1 Xx3)->False))) ((Xp1 Xx4)->False))) ((Xp2 Xx0)->False))) ((Xp2 Xx1)->False))) (Xp2 Xx2))) ((Xp2 Xx3)->False))) ((Xp2 Xx4)->False))) ((Xp3 Xx0)->False))) ((Xp3 Xx1)->False))) ((Xp3 Xx2)->False))) (Xp3 Xx3))) ((Xp3 Xx4)->False))) (((G Xx1) Xx0)->False))) (((G Xx2) Xx0)->False))) (((G Xx2) Xx1)->False))) (((G Xx3) Xx0)->False))) (((G Xx3) Xx1)->False))) (((G Xx3) Xx2)->False))) (((G Xx4) Xx0)->False))) (((G Xx4) Xx1)->False))) (((G Xx4) Xx2)->False))) (((G Xx4) Xx3)->False))))))))))))))))))))))) of role conjecture named ramsey_u_3_5_16
% Conjecture to prove = (forall (G:((Prop->(Prop->Prop))->((Prop->(Prop->Prop))->Prop))), ((forall (Xx:(Prop->(Prop->Prop))) (Xy:(Prop->(Prop->Prop))), (((G Xx) Xy)->((G Xy) Xx)))->((or ((ex (Prop->(Prop->Prop))) (fun (Xx0:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx1:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx2:(Prop->(Prop->Prop)))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp0:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp1:((Prop->(Prop->Prop))->Prop))=> ((and ((and ((and ((and ((and ((and ((and ((and (Xp0 Xx0)) ((Xp0 Xx1)->False))) ((Xp0 Xx2)->False))) ((Xp1 Xx0)->False))) (Xp1 Xx1))) ((Xp1 Xx2)->False))) ((G Xx1) Xx0))) ((G Xx2) Xx0))) ((G Xx2) Xx1))))))))))))) ((ex (Prop->(Prop->Prop))) (fun (Xx0:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx1:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx2:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx3:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx4:(Prop->(Prop->Prop)))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp0:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp1:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp2:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp3:((Prop->(Prop->Prop))->Prop))=> ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and (Xp0 Xx0)) ((Xp0 Xx1)->False))) ((Xp0 Xx2)->False))) ((Xp0 Xx3)->False))) ((Xp0 Xx4)->False))) ((Xp1 Xx0)->False))) (Xp1 Xx1))) ((Xp1 Xx2)->False))) ((Xp1 Xx3)->False))) ((Xp1 Xx4)->False))) ((Xp2 Xx0)->False))) ((Xp2 Xx1)->False))) (Xp2 Xx2))) ((Xp2 Xx3)->False))) ((Xp2 Xx4)->False))) ((Xp3 Xx0)->False))) ((Xp3 Xx1)->False))) ((Xp3 Xx2)->False))) (Xp3 Xx3))) ((Xp3 Xx4)->False))) (((G Xx1) Xx0)->False))) (((G Xx2) Xx0)->False))) (((G Xx2) Xx1)->False))) (((G Xx3) Xx0)->False))) (((G Xx3) Xx1)->False))) (((G Xx3) Xx2)->False))) (((G Xx4) Xx0)->False))) (((G Xx4) Xx1)->False))) (((G Xx4) Xx2)->False))) (((G Xx4) Xx3)->False))))))))))))))))))))))):Prop
% We need to prove ['(forall (G:((Prop->(Prop->Prop))->((Prop->(Prop->Prop))->Prop))), ((forall (Xx:(Prop->(Prop->Prop))) (Xy:(Prop->(Prop->Prop))), (((G Xx) Xy)->((G Xy) Xx)))->((or ((ex (Prop->(Prop->Prop))) (fun (Xx0:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx1:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx2:(Prop->(Prop->Prop)))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp0:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp1:((Prop->(Prop->Prop))->Prop))=> ((and ((and ((and ((and ((and ((and ((and ((and (Xp0 Xx0)) ((Xp0 Xx1)->False))) ((Xp0 Xx2)->False))) ((Xp1 Xx0)->False))) (Xp1 Xx1))) ((Xp1 Xx2)->False))) ((G Xx1) Xx0))) ((G Xx2) Xx0))) ((G Xx2) Xx1))))))))))))) ((ex (Prop->(Prop->Prop))) (fun (Xx0:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx1:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx2:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx3:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx4:(Prop->(Prop->Prop)))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp0:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp1:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp2:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp3:((Prop->(Prop->Prop))->Prop))=> ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and (Xp0 Xx0)) ((Xp0 Xx1)->False))) ((Xp0 Xx2)->False))) ((Xp0 Xx3)->False))) ((Xp0 Xx4)->False))) ((Xp1 Xx0)->False))) (Xp1 Xx1))) ((Xp1 Xx2)->False))) ((Xp1 Xx3)->False))) ((Xp1 Xx4)->False))) ((Xp2 Xx0)->False))) ((Xp2 Xx1)->False))) (Xp2 Xx2))) ((Xp2 Xx3)->False))) ((Xp2 Xx4)->False))) ((Xp3 Xx0)->False))) ((Xp3 Xx1)->False))) ((Xp3 Xx2)->False))) (Xp3 Xx3))) ((Xp3 Xx4)->False))) (((G Xx1) Xx0)->False))) (((G Xx2) Xx0)->False))) (((G Xx2) Xx1)->False))) (((G Xx3) Xx0)->False))) (((G Xx3) Xx1)->False))) (((G Xx3) Xx2)->False))) (((G Xx4) Xx0)->False))) (((G Xx4) Xx1)->False))) (((G Xx4) Xx2)->False))) (((G Xx4) Xx3)->False)))))))))))))))))))))))']
% Trying to prove (forall (G:((Prop->(Prop->Prop))->((Prop->(Prop->Prop))->Prop))), ((forall (Xx:(Prop->(Prop->Prop))) (Xy:(Prop->(Prop->Prop))), (((G Xx) Xy)->((G Xy) Xx)))->((or ((ex (Prop->(Prop->Prop))) (fun (Xx0:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx1:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx2:(Prop->(Prop->Prop)))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp0:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp1:((Prop->(Prop->Prop))->Prop))=> ((and ((and ((and ((and ((and ((and ((and ((and (Xp0 Xx0)) ((Xp0 Xx1)->False))) ((Xp0 Xx2)->False))) ((Xp1 Xx0)->False))) (Xp1 Xx1))) ((Xp1 Xx2)->False))) ((G Xx1) Xx0))) ((G Xx2) Xx0))) ((G Xx2) Xx1))))))))))))) ((ex (Prop->(Prop->Prop))) (fun (Xx0:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx1:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx2:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx3:(Prop->(Prop->Prop)))=> ((ex (Prop->(Prop->Prop))) (fun (Xx4:(Prop->(Prop->Prop)))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp0:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp1:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp2:((Prop->(Prop->Prop))->Prop))=> ((ex ((Prop->(Prop->Prop))->Prop)) (fun (Xp3:((Prop->(Prop->Prop))->Prop))=> ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and ((and (Xp0 Xx0)) ((Xp0 Xx1)->False))) ((Xp0 Xx2)->False))) ((Xp0 Xx3)->False))) ((Xp0 Xx4)->False))) ((Xp1 Xx0)->False))) (Xp1 Xx1))) ((Xp1 Xx2)->False))) ((Xp1 Xx3)->False))) ((Xp1 Xx4)->False))) ((Xp2 Xx0)->False))) ((Xp2 Xx1)->False))) (Xp2 Xx2))) ((Xp2 Xx3)->False))) ((Xp2 Xx4)->False))) ((Xp3 Xx0)->False))) ((Xp3 Xx1)->False))) ((Xp3 Xx2)->False))) (Xp3 Xx3))) ((Xp3 Xx4)->False))) (((G Xx1) Xx0)->False))) (((G Xx2) Xx0)->False))) (((G Xx2) Xx1)->False))) (((G Xx3) Xx0)->False))) (((G Xx3) Xx1)->False))) (((G Xx3) Xx2)->False))) (((G Xx4) Xx0)->False))) (((G Xx4) Xx1)->False))) (((G Xx4) Xx2)->False))) (((G Xx4) Xx3)->False)))))))))))))))))))))))
% Found x00:(x4 x2)
% Found x00 as proof of False
% Found (fun (x00:(x4 x2))=> x00) as proof of False
% Found (fun (x00:(x4 x2))=> x00) as proof of ((x4 x2)->False)
% Found x00:(x4 x2)
% Found x00 as proof of False
% Found (fun (x00:(x4 x2))=> x00) as proof of False
% Found (fun (x00:(x4 x2))=> x00) as proof of ((x4 x2)->False)
% Found x00:(x4 x0)
% Found (fun (x00:(x4 x0))=> x00) as proof of False
% Found (fun (x00:(x4 x0))=> x00) as proof of ((x4 x0)->False)
% Found x00:(x4 x0)
% Found x00 as proof of False
% Found (fun (x00:(x4 x0))=> x00) as proof of False
% Found (fun (x00:(x4 x0))=> x00) as proof of ((x4 x0)->False)
% Found x00:(x4 x0)
% Found (fun (x00:(x4 x0))=> x00) as proof of False
% Found (fun (x00:(x4 x0))=> x00) as proof of ((x4 x0)->False)
% Found x00:(x4 x0)
% Found x00 as proof of False
% Found (fun (x00:(x4 x0))=> x00) as proof of False
% Found (fun (x00:(x4 x0))=> x00) as proof of ((x4 x0)->False)
% Found x00:(x3 x2)
% Found x00 as proof of False
% Found (fun (x00:(x3 x2))=> x00) as proof of False
% Found (fun (x00:(x3 x2))=> x00) as proof of ((x3 x2)->False)
% Found x00:(x3 x2)
% Found x00 as proof of False
% Found (fun (x00:(x3 x2))=> x00) as proof of False
% Found (fun (x00:(x3 x2))=> x00) as proof of ((x3 x2)->False)
% Found x00:(x3 x2)
% Found x00 as proof of False
% Found (fun (x00:(x3 x2))=> x00) as proof of False
% Found (fun (x00:(x3 x2))=> x00) as proof of ((x3 x2)->False)
% Found x00:(x3 x2)
% Found x00 as proof of False
% Found (fun (x00:(x3 x2))=> x00) as proof of False
% Found (fun (x00:(x3 x2))=> x00) as proof of ((x3 x2)->False)
% Found x3:=(fun (a0:(Prop->(Prop->Prop)))=> (((Prop->(Prop->Prop))->Prop)->False)):((Prop->(Prop->Prop))->Prop)
% Found x3 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x3) as proof of False
% Found (x00 x3) as proof of False
% Found (fun (x00:(x3 x2))=> (x00 x3)) as proof of False
% Found (fun (x00:(x3 x2))=> (x00 x3)) as proof of ((x3 x2)->False)
% Found x00:(x3 x1)
% Found (fun (x00:(x3 x1))=> x00) as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of ((x3 x1)->False)
% Found x00:(x3 x1)
% Found (fun (x00:(x3 x1))=> x00) as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of ((x3 x1)->False)
% Found x3:=(fun (a0:(Prop->(Prop->Prop)))=> (((Prop->(Prop->Prop))->Prop)->False)):((Prop->(Prop->Prop))->Prop)
% Found x3 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x3) as proof of False
% Found (x00 x3) as proof of False
% Found (fun (x00:(x3 x2))=> (x00 x3)) as proof of False
% Found (fun (x00:(x3 x2))=> (x00 x3)) as proof of ((x3 x2)->False)
% Found x00:(x3 x1)
% Found x00 as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of ((x3 x1)->False)
% Found x00:(x3 x1)
% Found x00 as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of ((x3 x1)->False)
% Found x00:(x3 x1)
% Found (fun (x00:(x3 x1))=> x00) as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of ((x3 x1)->False)
% Found x00:(x3 x1)
% Found (fun (x00:(x3 x1))=> x00) as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of ((x3 x1)->False)
% Found x3:=(fun (a0:(Prop->(Prop->Prop)))=> (((Prop->(Prop->Prop))->Prop)->False)):((Prop->(Prop->Prop))->Prop)
% Found x3 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x3) as proof of False
% Found (fun (x00:(x3 x1))=> (x00 x3)) as proof of False
% Found (fun (x00:(x3 x1))=> (x00 x3)) as proof of ((x3 x1)->False)
% Found x00:(x3 x1)
% Found x00 as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of ((x3 x1)->False)
% Found x00:(x3 x1)
% Found x00 as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of False
% Found (fun (x00:(x3 x1))=> x00) as proof of ((x3 x1)->False)
% Found x3:=(fun (a0:(Prop->(Prop->Prop)))=> (((Prop->(Prop->Prop))->Prop)->False)):((Prop->(Prop->Prop))->Prop)
% Found x3 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x3) as proof of False
% Found (x00 x3) as proof of False
% Found (fun (x00:(x3 x1))=> (x00 x3)) as proof of False
% Found (fun (x00:(x3 x1))=> (x00 x3)) as proof of ((x3 x1)->False)
% Found x3:=(fun (a0:(Prop->(Prop->Prop)))=> (((Prop->(Prop->Prop))->Prop)->False)):((Prop->(Prop->Prop))->Prop)
% Found x3 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x3) as proof of False
% Found (fun (x00:(x3 x1))=> (x00 x3)) as proof of False
% Found (fun (x00:(x3 x1))=> (x00 x3)) as proof of ((x3 x1)->False)
% Found x3:=(fun (a0:(Prop->(Prop->Prop)))=> (((Prop->(Prop->Prop))->Prop)->False)):((Prop->(Prop->Prop))->Prop)
% Found x3 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x3) as proof of False
% Found (x00 x3) as proof of False
% Found (fun (x00:(x3 x1))=> (x00 x3)) as proof of False
% Found (fun (x00:(x3 x1))=> (x00 x3)) as proof of ((x3 x1)->False)
% Found x00:(x8 x4)
% Found x00 as proof of False
% Found (fun (x00:(x8 x4))=> x00) as proof of False
% Found (fun (x00:(x8 x4))=> x00) as proof of ((x8 x4)->False)
% Found x00:(x8 x4)
% Found x00 as proof of False
% Found (fun (x00:(x8 x4))=> x00) as proof of False
% Found (fun (x00:(x8 x4))=> x00) as proof of ((x8 x4)->False)
% Found x00:(x8 x2)
% Found (fun (x00:(x8 x2))=> x00) as proof of False
% Found (fun (x00:(x8 x2))=> x00) as proof of ((x8 x2)->False)
% Found x00:(x8 x2)
% Found x00 as proof of False
% Found (fun (x00:(x8 x2))=> x00) as proof of False
% Found (fun (x00:(x8 x2))=> x00) as proof of ((x8 x2)->False)
% Found x00:(x8 x2)
% Found (fun (x00:(x8 x2))=> x00) as proof of False
% Found (fun (x00:(x8 x2))=> x00) as proof of ((x8 x2)->False)
% Found x00:(x8 x2)
% Found x00 as proof of False
% Found (fun (x00:(x8 x2))=> x00) as proof of False
% Found (fun (x00:(x8 x2))=> x00) as proof of ((x8 x2)->False)
% Found x00:(x8 x1)
% Found (fun (x00:(x8 x1))=> x00) as proof of False
% Found (fun (x00:(x8 x1))=> x00) as proof of ((x8 x1)->False)
% Found x00:(x8 x1)
% Found (fun (x00:(x8 x1))=> x00) as proof of False
% Found (fun (x00:(x8 x1))=> x00) as proof of ((x8 x1)->False)
% Found x00:(x8 x1)
% Found x00 as proof of False
% Found (fun (x00:(x8 x1))=> x00) as proof of False
% Found (fun (x00:(x8 x1))=> x00) as proof of ((x8 x1)->False)
% Found x00:(x8 x1)
% Found (fun (x00:(x8 x1))=> x00) as proof of False
% Found (fun (x00:(x8 x1))=> x00) as proof of ((x8 x1)->False)
% Found x00:(x8 x1)
% Found (fun (x00:(x8 x1))=> x00) as proof of False
% Found (fun (x00:(x8 x1))=> x00) as proof of ((x8 x1)->False)
% Found x00:(x8 x1)
% Found x00 as proof of False
% Found (fun (x00:(x8 x1))=> x00) as proof of False
% Found (fun (x00:(x8 x1))=> x00) as proof of ((x8 x1)->False)
% Found x00:(x8 x0)
% Found (fun (x00:(x8 x0))=> x00) as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of ((x8 x0)->False)
% Found x00:(x8 x0)
% Found (fun (x00:(x8 x0))=> x00) as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of ((x8 x0)->False)
% Found x00:(x8 x0)
% Found (fun (x00:(x8 x0))=> x00) as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of ((x8 x0)->False)
% Found x00:(x8 x0)
% Found x00 as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of ((x8 x0)->False)
% Found x00:(x8 x0)
% Found (fun (x00:(x8 x0))=> x00) as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of ((x8 x0)->False)
% Found x00:(x8 x0)
% Found (fun (x00:(x8 x0))=> x00) as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of ((x8 x0)->False)
% Found x00:(x8 x0)
% Found (fun (x00:(x8 x0))=> x00) as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of ((x8 x0)->False)
% Found x00:(x8 x0)
% Found x00 as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of False
% Found (fun (x00:(x8 x0))=> x00) as proof of ((x8 x0)->False)
% Found x00:(x7 x4)
% Found x00 as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of ((x7 x4)->False)
% Found x00:(x7 x4)
% Found x00 as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of ((x7 x4)->False)
% Found x00:(x7 x4)
% Found x00 as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of ((x7 x4)->False)
% Found x00:(x7 x4)
% Found x00 as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of ((x7 x4)->False)
% Found x00:(x7 x4)
% Found x00 as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of ((x7 x4)->False)
% Found x00:(x7 x4)
% Found x00 as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of ((x7 x4)->False)
% Found x00:(x7 x4)
% Found x00 as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of ((x7 x4)->False)
% Found x00:(x7 x4)
% Found x00 as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of False
% Found (fun (x00:(x7 x4))=> x00) as proof of ((x7 x4)->False)
% Found x7:=(fun (a0:(Prop->(Prop->Prop)))=> (((Prop->(Prop->Prop))->Prop)->False)):((Prop->(Prop->Prop))->Prop)
% Found x7 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x7) as proof of False
% Found (x00 x7) as proof of False
% Found (fun (x00:(x7 x4))=> (x00 x7)) as proof of False
% Found (fun (x00:(x7 x4))=> (x00 x7)) as proof of ((x7 x4)->False)
% Found x00:(x7 x3)
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x8:=??:((Prop->(Prop->Prop))->Prop)
% Found x8 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x8) as proof of False
% Found (x00 x8) as proof of False
% Found (fun (x00:(x7 x4))=> (x00 x8)) as proof of False
% Found (fun (x00:(x7 x4))=> (x00 x8)) as proof of ((x7 x4)->False)
% Found x00:(x7 x3)
% Found x00 as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found x00 as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found x00 as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found x00 as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x8:=??:((Prop->(Prop->Prop))->Prop)
% Found x8 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x8) as proof of False
% Found (fun (x00:(x7 x3))=> (x00 x8)) as proof of False
% Found (fun (x00:(x7 x3))=> (x00 x8)) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found x00 as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found x00 as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found x00 as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x00:(x7 x3)
% Found x00 as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of False
% Found (fun (x00:(x7 x3))=> x00) as proof of ((x7 x3)->False)
% Found x8:=??:((Prop->(Prop->Prop))->Prop)
% Found x8 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x8) as proof of False
% Found (x00 x8) as proof of False
% Found (fun (x00:(x7 x3))=> (x00 x8)) as proof of False
% Found (fun (x00:(x7 x3))=> (x00 x8)) as proof of ((x7 x3)->False)
% Found x5:=??:((Prop->(Prop->Prop))->Prop)
% Found x5 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x5) as proof of False
% Found (fun (x00:(x7 x3))=> (x00 x5)) as proof of False
% Found (fun (x00:(x7 x3))=> (x00 x5)) as proof of ((x7 x3)->False)
% Found x5:=??:((Prop->(Prop->Prop))->Prop)
% Found x5 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x5) as proof of False
% Found (x00 x5) as proof of False
% Found (fun (x00:(x7 x3))=> (x00 x5)) as proof of False
% Found (fun (x00:(x7 x3))=> (x00 x5)) as proof of ((x7 x3)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found x00 as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found x00 as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found x00 as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found x00 as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x6:=??:((Prop->(Prop->Prop))->Prop)
% Found x6 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x6) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x6)) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x6)) as proof of ((x7 x1)->False)
% Found x6:=??:((Prop->(Prop->Prop))->Prop)
% Found x6 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x6) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x6)) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x6)) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found x00 as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found x00 as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found x00 as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x00:(x7 x1)
% Found x00 as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of False
% Found (fun (x00:(x7 x1))=> x00) as proof of ((x7 x1)->False)
% Found x6:=??:((Prop->(Prop->Prop))->Prop)
% Found x6 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x6) as proof of False
% Found (x00 x6) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x6)) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x6)) as proof of ((x7 x1)->False)
% Found x8:=??:((Prop->(Prop->Prop))->Prop)
% Found x8 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x8) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x8)) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x8)) as proof of ((x7 x1)->False)
% Found x8:=??:((Prop->(Prop->Prop))->Prop)
% Found x8 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x8) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x8)) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x8)) as proof of ((x7 x1)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x8:=??:((Prop->(Prop->Prop))->Prop)
% Found x8 as proof of ((Prop->(Prop->Prop))->Prop)
% Found (x00 x8) as proof of False
% Found (x00 x8) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x8)) as proof of False
% Found (fun (x00:(x7 x1))=> (x00 x8)) as proof of ((x7 x1)->False)
% Found x00:(x7 x0)
% Found x00 as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found x00 as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found x00 as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found x00 as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (fun (x00:(x7 x0))=> x00) as proof of ((x7 x0)->False)
% Found x00:(x7 x0)
% Found (fun (x00:(x7 x0))=> x00) as proof of False
% Found (f
% EOF
%------------------------------------------------------------------------------